Search results for "finite [mass]"

A SYMMETRIC AND POSITIVE DEFINITE BEM FOR 2-D FORCED VIBRATIONS

1997

A BEM formulation for 2D elastodynamics in the time domain has been presented. The formulation gives a resolving system that involves boundary displacements only. The stiffness and mass matrices of the boundary discretized body are frequency independent, symmetric and positive definite

Arithmetical Analysis of Biomolecular Finite Automaton

2013

In the paper we present a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.

Relative principal congruences in congruence-modular quasivarieties

1998

The problem of definability of relative principal congruences in relatively congruence modular (RCM) quasivarieties is investigated. The RCM quasivarieties are characterized in terms of parameterized families of finite sets of pairs of terms which define relative principal congruences.

A Criterium for the Strict Positivity of the Density of the Law of a Poisson Process

2011

We translate in semigroup theory our result (Leandre, 1990) giving a necessary condition so that the law of a Markov process with jumps could have a strictly positive density. This result express, that we have to jump in a finite number of jumps in a "submersive" way from the starting point to the end point if the density of the jump process is strictly positive in . We use the Malliavin Calculus of Bismut type of (Leandre, (2008;2010)) translated in semi-group theory as a tool, and the interpretation in semi-group theory of some classical results of the stochastic analysis for Poisson process as, for instance, the formula giving the law of a compound Poisson process.

Injectors with a normal complement in a finite solvable group

2011

Abstract Suppose G is a finite solvable group, and H is a subgroup with a normal complement in G. We shall find necessary and sufficient conditions (some of which are related to the properties of coprime actions) for H to be an injector in G. We shall also use these criteria to find characterizations of injectors which need not have a normal complement.

About Quotient Orders and Ordering Sequences

2017

Summary In preparation for the formalization in Mizar [4] of lotteries as given in [14], this article closes some gaps in the Mizar Mathematical Library (MML) regarding relational structures. The quotient order is introduced by the equivalence relation identifying two elements x, y of a preorder as equivalent if x ⩽ y and y ⩽ x. This concept is known (see e.g. chapter 5 of [19]) and was first introduced into the MML in [13] and that work is incorporated here. Furthermore given a set A, partition D of A and a finite-support function f : A → ℝ, a function Σ f : D → ℝ, Σ f (X)= ∑ x∈X f(x) can be defined as some kind of natural “restriction” from f to D. The first main result of this article ca…

Some considerations on Hydra groups and a new bound for the length of words

2014

Abstract After a survey on some recent results of Riley and others on Ackermann functions and Hydra groups, we make an analogy between DNA sequences, whose growth is the same of that of Hydra groups, and a musical piece, written with the same algorithmic criterion. This is mainly an aesthetic observation, which emphasizes the importance of the combinatorics of words in two different contexts. A result of specific mathematical interest is placed at the end, where we sharpen some previous bounds on deterministic finite automata in which there are languages with hairpins.

Multi-letter reversible and quantum finite automata

2007

The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversible FA model) which is able to recognize this language. We also completely characterise the set of languages recognizable by the new model FAs, by finding a "forbidden construction" whose presence or absence in the minimal deterministic (not necessaril…

Some applications of a fundamental theorem by Gluck and Wolf in the character theory of finite groups

1986

Characters and Blocks of Finite Groups

1998

This is a clear, accessible and up-to-date exposition of modular representation theory of finite groups from a character-theoretic viewpoint. After a short review of the necessary background material, the early chapters introduce Brauer characters and blocks and develop their basic properties. The next three chapters study and prove Brauer's first, second and third main theorems in turn. These results are then applied to prove a major application of finite groups, the Glauberman Z*-theorem. Later chapters examine Brauer characters in more detail. The relationship between blocks and normal subgroups is also explored and the modular characters and blocks in p-solvable groups are discussed. Fi…